منابع مشابه
On Dynamic Bit-Probe Complexity
This work present several advances in the understanding of dynamic data structures in the bit-probe model: • We improve the lower bound record for dynamic language membership problems to Ω(( lg n lg lg n ) ). Surpassing Ω(lg n) was listed as the first open problem in a survey by Miltersen. • We prove a bound of Ω( lg n lg lg lg n ) for maintaining partial sums in Z/2Z. Previously, the known bou...
متن کاملComplexity Measure Revisited: a New Algorithm for Classifying Cardiac Arrhythmias
3 21/21=100 44/61=72.1 54/56=96.4 119/138=86.2 4 21/21=100 46/61=75.4 53/56=94.6 120/138=86.9 5 21/21=100 47/61=77 53/56=94.6 121/138=87.7 6 21/21=100 47/61=77 53/56=94.6 121/138=87.7 7 21/21=100 50/61=81.9 52/56=92.8 123/138=89.1 8 21/21=100 50/61=81.9 53/56=94.6 124/138=89.8 9 21/21=100 49/61=80.3 53/56=94.6 123/138=89.1 10 21/21=100 48/61=78.7 51/56=91 120/138=86.9 Performance of SPDR-CM for...
متن کاملThe Bit Complexity of the Predecessor Problem
Tight bound of 2n ? 1 bits on the communication complexity of \The Pre-decessor" problem in a synchronous ring (previously known as \The last in a synchronous ring" problem) is presented.
متن کاملAverage Case Complexity, Revisited
More than two decades elapsed since Levin set forth a theory of average-case complexity. In this survey we present the basic aspects of this theory as well as some of the main results regarding it. The current presentation deviates from our old “Notes on Levin’s Theory of Average-Case Complexity” (ECCC, TR97-058, 1997) in several aspects.
متن کاملReversal complexity revisited
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several further tapes on which head reversals remain unrestricted, but size is bounded by s(n) (where n denotes the input length). Recently [9,10], such machines were introduced as a formalization of a computation model that restr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DAIMI Report Series
سال: 1992
ISSN: 2245-9316,0105-8517
DOI: 10.7146/dpb.v21i396.6631